On Naïve Crossover Biases with Reproduction for Simple Solutions to Classification Problems
نویسندگان
چکیده
A series of simple biases to the selection of crossover points in treestructured genetic programming are investigated with respect to the provision of parsimonious solutions. Such a set of biases has a minimal computational overhead as they are based on information already used to estimate the fitness of individuals. Reductions to code bloat are demonstrated for the real world classification problems investigated. Moreover, bloated solutions provided by a uniform crossover operator often appear to defeat the application of MAPLETM simplification heuristics.
منابع مشابه
Comparison of Decision Tree and Naïve Bayes Methods in Classification of Researcher’s Cognitive Styles in Academic Environment
In today world of internet, it is important to feedback the users based on what they demand. Moreover, one of the important tasks in data mining is classification. Today, there are several classification techniques in order to solve the classification problems like Genetic Algorithm, Decision Tree, Bayesian and others. In this article, it is attempted to classify researchers to “Expert” and “No...
متن کاملComparison of Decision Tree and Naïve Bayes Methods in Classification of Researcher’s Cognitive Styles in Academic Environment
In today world of internet, it is important to feedback the users based on what they demand. Moreover, one of the important tasks in data mining is classification. Today, there are several classification techniques in order to solve the classification problems like Genetic Algorithm, Decision Tree, Bayesian and others. In this article, it is attempted to classify researchers to “Expert” and “No...
متن کاملThe Distributional Biases of Crossover Operators
The choice of genetic operators is one way in which genetic algorithms can be tailored to speciic optimization problems. For bit represented problems, the choice of crossover operator , or the choice not to use a crossover operator, can dramatically aaect search performance. The eecacy of crossover for genetic search is governed by the relationship between the crossover biases and the search pr...
متن کاملRobust Encodings of OR Problems for Genetic Algorithms
Genetic algorithms were developed in computer science in the mid 60's by Holland 1975]. They seek to breed good solutions to complex problems by a paradigm that mimics evolution. A population of solutions is constructed. Solutions in the population mate and bear oospring solutions in the next generation. These \reproduction" and \crossover" operations are programmed to replicate the paradigm of...
متن کاملDiscrete PSO with GA Operators for Document Clustering
The paper presents Discrete PSO algorithm for document clustering problems. This algorithm is hybrid of PSO with GA operators. The proposed system is based on population-based heuristic search technique, which can be used to solve combinatorial optimization problems, modeled on the concepts of cultural and social rules derived from the analysis of the swarm intelligence (PSO) with GA operators ...
متن کامل